Simulative belief logic
نویسندگان
چکیده
منابع مشابه
Simulative Inference in a Computational Model of Belief
We propose a semantics for belief in which the derivation of new beliefs from old ones is modeled as a computational process. Using this model, we characterize conditions under which it is appropriate to reason about other agents by simulating their inference processes with one’s own. This work was supported in part by ARPA grant F30602-95-1-0025 and NSF grant IRI-9503312. Rajesh Rao contribute...
متن کاملA Belief-Function Logic
We present BFL, a hybrid logic for representing uncertain knowledge. BFL attaches a quantified notion of belief based on Dempster-Shafer’s theory of belief functions to classical first-order logic. The language of BFL is composed of objects of the form F:[a,b], where F is a first-order sentence, and Q and b are numbers in the [O,l] interval (with c&b). Intuitively, a measures the strength of ou...
متن کاملProbabilistic Logic for Belief Nets
We describe how to combine probabilistic logic and Bayesian networks to obtain a new framework (\Bayesian logic") for dealing with uncertainty and causal relationships in an expert system. Probabilistic logic, invented by Boole, is a technique for drawing inferences from uncertain propositions for which there are no independence assumptions. A Bayesian network is a \belief net" that can represe...
متن کاملBelief Maintenance with Probabilistic Logic
Belief maintenance systems are natural extensions of truth maintenance systems that use probabilities rather than boolean truth-values. This paper introduces a general method for belief maintenance, based on (the propositional fragment of) probabilistic logic, that extends the Boolean Constraint Propagation method used by the logic-based truth maintenance systems. From the concept of probabilis...
متن کاملDynamic logic for belief revision
We show how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are added. The core engine consists of definable update rules for changing plausibility relations between worlds, which have been proposed independently in the dynamic-epistemic literature on preference change. Our analysis yields two new types of modal result....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Logic
سال: 2013
ISSN: 1570-8683
DOI: 10.1016/j.jal.2013.03.008